#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <set>
#include "tree.h"

using namespace std;

void levelPrint(Tree *root)
{
    queue<Tree *> Q;
    int curLevel = 1, nextLevel = 0;
    Q.push(root);
    while(!Q.empty()) {
        Tree *cur = Q.front();
        Q.pop();
        cout << cur->data << " ";
        curLevel--;
        if (cur->left) {
            Q.push(cur->left);
            nextLevel++;
        }
        if (cur->right) {
            Q.push(cur->right);
            nextLevel++;
        }
        if (curLevel == 0) {
            curLevel = nextLevel;
            nextLevel = 0;
            cout << endl;
        }
    }

}

int main(int argc, char **argv)
{
    int input[] = {21,7,5,6,3,2,1,4,6,23,43,54,12,54,8,10,11,35,56};
    //int input[] = {7};
    Tree *root = NULL, *root2 = NULL;
    int result;

    for (int i = 0; i < sizeof(input)/sizeof(int); i++) {
        TreeInsert(root, input[i]);
    }
    print_ascii_tree(root);
    levelPrint(root);
}
